The Variance of the Number of 2-Protected Nodes in a Trie
نویسندگان
چکیده
We derive an asymptotic expression for the variance of the number of 2-protected nodes (neither leaves nor parents of leaves) in a binary trie. In an unbiased trie on n leaves we find, for example, that the variance is approximately .934n plus small fluctuations (also of order n); but our result covers the general (biased) case as well. Our proof relies on the asymptotic similarities between a trie and its Poissonized counterpart, whose behavior we glean via the Mellin transform and singularity analysis.
منابع مشابه
On the Number of 2-Protected Nodes in Tries and Suffix Trees
We use probabilistic and combinatorial tools on strings to discover the average number of 2-protected nodes in tries and in suffix trees. Our analysis covers both the uniform and non-uniform cases. For instance, in a uniform trie with n leaves, the number of 2-protected nodes is approximately 0.803n, plus small first-order fluctuations. The 2-protected nodes are an emerging way to distinguish t...
متن کاملOn the variance of the external path length in a symmetric digital trie
Digital searching is a well-known technique for storing and retrieving information using lexicographical (digital) structure of words. A radix trie (in short: trie) is such a digital search tree that edges are labelled by elements from aa alphabet (e.g., binary alphabet consisting of O’s and l’s) and leaves (external nodes) contain keys [ 1,4,9]. More precisely, in a binary case a key is a (pos...
متن کاملThe Oscillatory Distribution of Distances in Random Tries
We investigate ∆n, the distance between randomly selected pairs of nodes among n keys in a random trie, which is a kind of digital tree. Analytical techniques, such as the Mellin transform and an excursion between poissonization and depoissonization, capture small fluctuations in the mean and variance of these random distances. The mean increases logarithmically in the number of keys, but curio...
متن کاملOn the effect of low-quality node observation on learning over incremental adaptive networks
In this paper, we study the impact of low-quality node on the performance of incremental least mean square (ILMS) adaptive networks. Adaptive networks involve many nodes with adaptation and learning capabilities. Low-quality mode in the performance of a node in a practical sensor network is modeled by the observation of pure noise (its observation noise) that leads to an unreliable measurement....
متن کاملLimit Distribution of Distances in Biased Random Tries
The trie is a sort of digital tree. Ideally, to achieve balance, the trie should grow from an unbiased source generating keys of bits with equal likelihoods. In practice, the lack of bias is not always guaranteed. We investigate the distance between randomly selected pairs of nodes among the keys in a biased trie. This research complements that of Christophi and Mahmoud (2005); however, the res...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013